A heuristic method for obtaining quasi ARL-unbiased p-Charts
نویسندگان
چکیده
منابع مشابه
A Method for Obtaining
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: 1. Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intended recipient. Only he can decipher the message...
متن کاملD-Charts: Quasi-DevelopableMesh Segmentation
Quasi-developable mesh segmentation is required for many applications in graphics and CAD, including texture atlas generation and the design of patterns for model fabrication from sheets of material. In this work we introduce D-Charts, a simple and robust algorithm for mesh segmentation into (nearly) developable charts. As part of our method we introduce a new metric of developability for mesh ...
متن کاملAn efficient heuristic method for capacitated P-Median problem
Capacitated p-median problem (CPMP) is an important variation of facility location problem in which p capacitated medians are economically selected to serve a set of demand vertices so that the total assigned demand to each of the candidate medians must not exceed its capacity. The classical CPMP uses a network in a Euclidean plane such that distance between any two points in the network is the...
متن کاملA Crowdsourcing Method for Obtaining Rephrased Questions
We propose a method for obtaining and ranking paraphrased questions from crowds to be used as a part of instructions in microtask-based crowdsourcing. With our method, we are able to obtain questions that differ in expression yet have the same semantics with respect to the crowdsourcing task. This is done by generating tasks that give hints and elicit instructions from workers. We conducted exp...
متن کاملA new method for obtaining Fibonacci identities
For the Lucas sequence {Uk(P,Q)} we discuss the identities like the well-known Fibonacci identities. For example, the generalizations of F2k = F 2 k+1 − F 2 k−1 and F2k+1 = F 2 k+1 + F 2 k are PU2k = U 2 k+1 − QU k−1 and U2k+1 = U k+1 − QU k , respectively. We propose a new simple method for obtaining identities involving any recurrences and use it to obtain new identities involving the Fibonac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quality and Reliability Engineering International
سال: 2018
ISSN: 0748-8017
DOI: 10.1002/qre.2379